Decidability of Bisimilarity for One-Counter Processes
نویسنده
چکیده
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also niteness up to bisimilarity is shown to be decidable for the mentioned processes. 1 1 This paper is to appear in Information and Computation. The nal revisions were carried out while the author visited Uppsala university due to a STINT Fellowship programme grant. He is also partially supported by the Grant Agency of the Czech Republic, Grant No. 201/97/0456.
منابع مشابه
Complexity of Checking Bisimilarity between Sequential and Parallel Processes
Decidability of bisimilarity for Process Algebra (PA) processes, arising by mixing sequential and parallel composition, is a longstanding open problem. The known results for subclasses contain the decidability of bisimilarity between basic sequential (i.e. BPA) processes and basic parallel processes (BPP). Here we revisit this subcase and derive an exponential-time upper bound. Moreover, we sho...
متن کاملDecidability of Bisimilarity for One-Counter Processes1
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also niteness up to bisimilarity is shown to be decidable for the mentioned processes. 3
متن کاملBisimilarity of One-Counter Processes Is PSPACE-Complete
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (with no ε-steps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known PSPACE lower bound (Srba 2009). We add the PTIME-completeness result for deciding regularity (i.e...
متن کاملThe complexity of bisimilarity-checking for one-counter processes
We study the problem of bisimilarity-checking between processes of one-counter automata and finite-state processes. We show that deciding weak bisimilarity between processes of one-counter nets (which are ‘restricted’ one-counter automata where the counter cannot be tested for zero) and finite-state processes is DP-hard. In particular, this means that the problem is both NP and co-NP hard. The ...
متن کاملDecidability Questions for Bismilarity of Petri Nets and Some Related Problems
The main result is undecidability of bisimilarity for labelled (place/transition) Petri nets. The same technique applies to the (preex) language equivalence and reachability set equality, which yields stronger versions with simpler proofs of already known results. The paper also shows decidability of bisimilarity if one of the nets is deterministic up to bisimilarity. Another decidability resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 158 شماره
صفحات -
تاریخ انتشار 2000